منابع مشابه
study of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Some Results on Convex Spectral Functions: I
In this paper, we give a fundamental convexity preserving for spectral functions. Indeed, we investigate infimal convolution, Moreau envelope and proximal average for convex spectral functions, and show that this properties are inherited from the properties of its corresponding convex function. This results have many applications in Applied Mathematics such as semi-definite programmings and eng...
متن کاملStirling permutations on multisets
A permutation σ of a multiset is called Stirling permutation if σ(s) ≥ σ(i) as soon as σ(i) = σ(j) and i < s < j. In our paper we study Stirling polynomials that arise in the generating function for descent statistics on Stirling permutations of any multiset. We develop generalizations of the classical Stirling numbers and present their combinatorial interpretations. Particularly, we apply the ...
متن کاملSynergistic Solutions on MultiSets
Karp et al. (1988) described Deferred Data Structures for Multisets as “lazy” data structures which partially sort data to support online rank and select queries, with the minimum amount of work in the worst case over instances of size n and number of queries q fixed. Barbay et al. (2016) refined this approach to take advantage of the gaps between the positions hit by the queries (i.e., the str...
متن کاملGenerating Trees on Multisets
Given a multiset M = V1 ∪ V2 ∪ · · · ∪ VC of n elements and a capacity function ∆ : [1, C] → [2, n− 1], we consider the problem of enumerating all unrooted trees T on M such that the degree of each vertex v ∈ Vi is bounded from above by ∆(i). The problem has a direct application of enumerating isomers of tree-like chemical graphs. We give an algorithm that generates all such trees without dupli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2019
ISSN: 2073-8994
DOI: 10.3390/sym11091125